About Graph Sums
نویسندگان
چکیده
Summary In this article the sum (or disjoint union) of graphs is formalized in Mizar system [4], [1], based on formalization [9].
منابع مشابه
Reasoning about Graph Programs
GP 2 is a non-deterministic programming language for computing by graph transformation. One of the design goals for GP 2 is syntactic and semantic simplicity, to facilitate formal reasoning about programs. In this paper, we demonstrate with four case studies how programmers can prove termination and partial correctness of their solutions. We argue that GP 2’s graph transformation rules, togethe...
متن کاملSums of powers of the degrees of a graph
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k.
متن کاملDiscriminants, Symmetrized Graph Monomials, and Sums Of Squares
Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels of the original graph. We pose the question for which graphs this polynomial is a non-negative resp. a sum of squares. This problem is motivated by a recent...
متن کاملSums, Products and Ratios along the Edges of a Graph
In their seminal paper Erdős and Szemerédi formulated conjectures on the size of sumset and product set of integers. The strongest form of their conjecture is about sums and products along the edges of a graph. In this paper we show that this strong form of the Erdős-Szemerédi conjecture does not hold. We give upper and lower bounds on the cardinalities of sumsets, product sets and ratio sets a...
متن کاملShirali’s Questions About Sums of Residues of Squares
Shirali’s article [16] gives a delightful account of some of the differences between primes of the forms 4k+1 and 4k+3. In doing so he raises questions about the relation between certain sums of residues of squares and those integers d > 0 for which the ring of integers of the field Q (√ −d ) has the unique factorization property. We will show that a recent theorem of Schinzel can be used to an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2021
ISSN: ['1898-9934', '1426-2630']
DOI: https://doi.org/10.2478/forma-2021-0023